Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
381	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory
382	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics
383	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-13 17:17:56 Computational complexity theory Abstract algebra Linear algebra NP-complete problems Logic in computer science Boolean satisfiability problem Time complexity PP Element distinctness problem Theoretical computer science Mathematics Algebra
384	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes
385	Online Amnesic Approximation of Streaming Time Series Themistoklis Palpanas University of California, Riverside Michail Vlachos Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2003-12-20 03:52:30 Numerical analysis Computational complexity theory Digital signal processing Algorithm Mathematical logic Time complexity Priority queue Piecewise linear function Approximation Theoretical computer science Applied mathematics Mathematical analysis
386	PRIMES is in P Manindra Agrawal Neeraj Kayal ∗ Nitin Saxena Department of Computer Science & Engineering Add to Reading List Source URL: math.ucr.edu Language: English - Date: 2006-05-09 13:08:50 Primality tests Analytic number theory Finite fields Analysis of algorithms Computational complexity theory AKS primality test Prime number Randomized algorithm Time complexity Mathematics Abstract algebra Theoretical computer science
387	sigmodrecord-schweikardt.dvi Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-07-31 12:29:47 Analysis of algorithms Time complexity Randomized algorithm Sorting algorithm Algorithm L Merge sort Worst-case complexity Element distinctness problem Theoretical computer science Applied mathematics Computational complexity theory
388	2014 IEEE Annual Symposium on Foundations of Computer Science Threesomes, Degenerates, and Love Triangles Allan Grønlund Seth Pettie Add to Reading List Source URL: madalgo.au.dk Language: English - Date: 2015-04-22 04:53:32 Computational complexity theory Chernoff bound Randomized algorithm Time complexity Theoretical computer science Applied mathematics Analysis of algorithms
389	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2013-02-28 10:49:50 Analysis of algorithms Computational complexity theory Algorithm Mathematical logic Dynamic programming Time complexity ATS Randomized algorithm Pseudorandom generator theorem Theoretical computer science Applied mathematics Mathematics
390	1 Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-05-15 17:43:14 Numerical linear algebra Matrix theory Sparse matrix Matrix Sparse approximation Belief propagation Eigenvalues and eigenvectors Time complexity Algebra Mathematics Linear algebra

UPDATE